Partition Regular Structures Contained in Large Sets Are Abundant
نویسندگان
چکیده
منابع مشابه
Partition Regular Structures Contained in Large Sets Are Abundant
Furstenberg and Glasner have shown that for a particular notion of largeness in a group, namely piecewise syndeticity, if a set B is a large subset Z, then for any l # N, the set of length l arithmetic progressions lying entirely in B is large among the set of all length l aritmetic progressions. We extend this result to apply to infinitely many notions of largeness in arbitrary semigroups and ...
متن کاملLarge regular simplices contained in a hypercube
We prove that the n-dimensional unit hypercube contains an n-dimensional regular simplex of edge length c √ n, where c > 0 is a constant independent of n. Let l∆n be the n-dimensional regular simplex of edge length l, and let lQn be the n-dimensional hypercube of edge length l. For simplicity, we omit l if l= 1, e.g., Qn denotes the unit hypercube. We are interested in the maximum edge length o...
متن کاملInfinite Partition Regular Matrices: Solutions in Central Sets
A finite or infinite matrix A is image partition regular provided that whenever N is finitely colored, there must be some ~x with entries from N such that all entries of A~x are in the same color class. In contrast to the finite case, infinite image partition regular matrices seem very hard to analyze: they do not enjoy the closure and consistency properties of the finite case, and it is diffic...
متن کاملIndependent Sets in Graph Powers are Almost Contained in Juntas
Let G = (V,E) be a simple undirected graph. Define G, the n-th power of G, as the graph on the vertex set V n in which two vertices (u1, . . . , un) and (v1, . . . , vn) are adjacent if and only if ui is adjacent to vi in G for every i. We give a characterization of all independent sets in such graphs whenever G is connected and non-bipartite. Consider the stationary measure of the simple rando...
متن کاملA partition theorem for α - large sets
Working with Hardy hierarchy and the notion of largeness determined by it, we define the notion of a partition of a finite set of natural numbers A = ∪i<mAi being α-large and show that for ordinals α, β < ε0 satisfying suitable assumptions, if A is (ω · α)-large and is partitioned as above and the partition itself is not α-large, then at least one Ai is ω -large. The goal of this paper is to wo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2001
ISSN: 0097-3165
DOI: 10.1006/jcta.2000.3061